An efficient algorithm for hidden surface removal, II

An Exact Incremental Hidden Surface Removal Algorithm

This paper describes an incremental Hidden Surface Removal Algorithm (HSRA), developed to be embedded in a new architecture for raster graphics described in [1,7]. The algorithm can be classified as "exact" since it operates in object space, rather than image space. It can be classified as "incremental" because this HSRA is able to support addition, removal and changes on a single object or a g...

Space-Efficient Hidden Surface Removal

We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings, for example to reduce working space for several graph algorithms. However, bit manipulation is not usually employed in geometric algorithms because the stan...

Efficient Architectures for Hidden Surface Removal

We present several new eecient architectures to solve the hidden surface problem in the feature domain. All the architectures operate on segments (instead of pix-els) and create a list of visible segments for each scan line. We present two new semi-systolic architectures consisting of an array of M processors, where M is the maximum number of overlapping segments. Both ar-chitectures require pr...

An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains

An Efficient Output-Sensitive Hidden-Surface Removal Algorithm for Polyhedral Terrains*

In this paper, we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly. For example, our results apply directly to terrain maps. A distinguishing feature of our algorithm is that its running time is sensitive to the actual size of the visible image, rather than the total number of intersections in th...